Isomorphism Between Two Vector General Fuzzy Automata
نویسندگان
چکیده
In this paper, at first, we define the notion of general fuzzy automaton over a field; call vector (VGFA). Moreover, present concept max-min automaton. We show that if two VGFA are similar, they constitute an isomorphism. After that, prove isomorphism with threshold α, equivalent where $\alpha \in [0,1]$. Also, some examples given to clarify these new notions.
منابع مشابه
Bipolar general fuzzy automata
In this paper, we define the notion of a bipolar general fuzzy automaton, then we construct some closure operators on the set of states of a bipolar general fuzzy automaton. Also, we construct some topologies on the set of states of a bipolar general fuzzy automaton. Then we obtain some relationships between them.
متن کاملIrreducibility on General Fuzzy Automata
The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.
متن کاملSome (Fuzzy) Topologies on General\ Fuzzy Automata
In this paper, by presenting some notions and theorems, we obtaindifferent types of fuzzy topologies. In fact, we obtain someLowen-type and Chang-type fuzzy topologies on general fuzzyautomata. To this end, first we define a Kuratowski fuzzy interioroperator which induces a Lowen-type fuzzy topology on the set ofstates of a max- min general fuzzy automaton. Also by provingsome theorems, ...
متن کاملHYPERGROUPS AND GENERAL FUZZY AUTOMATA
In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...
متن کاملTransformation of BL-general Fuzzy Automata
In this paper, we prove that any BL-general fuzzy automaton (BL-GFA) and its quotient have the same behavior. In addition, we obtain the minimal quotient BL-GFA and minimal quotient transformation of the BL-GFA, considering the notion of maximal admissible partition. Furthermore, we show that the number of input symbols and time complexity of the minimal quotient transformation of a BL-GFA are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatica (lithuanian Academy of Sciences)
سال: 2023
ISSN: ['1822-8844', '0868-4952']
DOI: https://doi.org/10.15388/23-infor514